Fuzzy Vehicle Routing Problem with Split Delivery: Trade-off between Air Pollution and Customer Satisfaction

A green vehicle routing problem with customer satisfaction criteria

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers’ satisfaction have been taken into account. Meanwhile, the introduced model prepares a...

Customer satisfaction in dynamic vehicle routing problem with time windows

The dynamic vehicle routing and scheduling problem is a well-known complex combinatorial optimization problem that drew significant attention over the past few years. This paper presents a novel algorithm introducing a new strategy to integrate anticipated future visit requests during plan generation, aimed vailable online xxx eywords: enetic algorithms ustomer satisfaction at explicitly improv...

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...

New Lower Bounds for the Split Delivery Vehicle Routing Problem

This paper presents an algorithm to obtain lower bounds for the Split Delivery Vehicle Routing Problem. An extended formulation over a large set of variables is provided and valid inequalities are identified. The algorithm combines column and cut generation and was able to improve the lower bound for almost all instances tested.

A STUDY ON THE SPLIT DELIVERY VEHICLE ROUTING PROBLEM By

A Construction Heuristic for the Split Delivery Vehicle Routing Problem

The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favora...